/*
自己选择的路 ,跪着也要走完。朋友们 , 虽然这个世界日益浮躁起来,只
要能够为了当时纯粹的梦想和感动坚持努力下去 , 不管其它人怎么样,我
们也能够保持自己的本色走下去。
To the world , you will be a person , but to a person , you
will be the world .                               ——AKPower
*/
//作者:AKPower
//算法:
#include <iostream>
#include <cmath>
#include <algorithm>
#include <cstring>
#include <vector>
#include <map>
#include <queue>
#include <cstdio>
#include <string>
#include <stack>
#include <set>
#define IOS ios::sync_with_stdio(false), cin.tie(0)
using namespace std;
typedef long long ll;
const ll mod = 998244353;
ll t, n, m;

ll gcd(ll a, ll b)
{
    ll sum = 1;
    while (b)
    {
        if (b & 1)
        {
            sum = (sum * a) % mod;
        }
        a = (a * a) % mod;
        b >>= 1;
    }
    return sum;
}

int main()
{
    IOS;
    cin >> t;
    while (t--)
    {
        cin >> n >> m;
        if (m == 0)
        {
            if (n == 1)
            {
                cout << 2 << endl;
            }
            else if (n == 0)
            {
                cout << 1 << endl;
            }
            else
                cout << n + 2 << endl;
            continue;
        }
        if (m == 1)
        {
            if (n == 0)
            {
                cout << 1 << endl;
            }
            else
                cout << (2 * n) % mod << endl;
            continue;
        }
        cout << gcd(2, n) << endl;
    }
    getchar();
    getchar();
    return 0;
}
